翻訳と辞書 |
Boolean hierarchy : ウィキペディア英語版 | Boolean hierarchy The boolean hierarchy is the hierarchy of boolean combinations (intersection, union and complementation) of NP sets. Equivalently, the boolean hierarchy can be described as the class of boolean circuits over NP predicates. A collapse of the boolean hierarchy would imply a collapse of the polynomial hierarchy. == Formal definition ==
BH is defined as follows: * BH1 is NP. * BH2k is the class of languages which are the intersection of a language in BH2k-1 and a language in coNP. * BH2k+1 is the class of languages which are the union of a language in BH2k and a language in NP. * BH is the union of the BHi
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Boolean hierarchy」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|